https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 Large networks bounded in degree and diameter https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:11550 Wed 11 Apr 2018 13:18:30 AEST ]]> Incremental network design with maximum flows https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:26872 Wed 04 Sep 2019 10:37:58 AEST ]]> Incremental network design with minimum spanning trees https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:31033 G=(V,E) and a set E0E, the incremental network design problem with minimum spanning trees asks for a sequence of edges e′1,…,e′TEE0 minimizing [formula could not be replicated] where w(Xt) is the weight of a minimum spanning tree Xt for the subgraph (V,E0∪{e′1,…,e′t}) and T=|EE0|. We prove that this problem can be solved by a greedy algorithm.]]> Wed 04 Sep 2019 09:39:31 AEST ]]> MaxDDBS problem on Beneš networks https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:32665 Tue 10 Jul 2018 10:51:11 AEST ]]> Searching for large multi-loop networks https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:19509 Sat 24 Mar 2018 08:02:18 AEDT ]]> Incremental network design with shortest paths https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:19239 Sat 24 Mar 2018 07:54:56 AEDT ]]> The maximum degree and diameter-bounded subgraph in the mesh https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:21755 Sat 24 Mar 2018 07:53:08 AEDT ]]> Degree diameter problem on honeycomb networks https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:19305 Sat 24 Mar 2018 07:49:59 AEDT ]]> The maximum degree & diameter-bounded subgraph and its applications https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:23514 Sat 24 Mar 2018 07:17:17 AEDT ]]> Improved load plan design through integer programming based local search https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:18719 Mon 20 Jul 2015 18:02:13 AEST ]]> Considering pricing and uncertainty in designing a reverse logistics network https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:49673 Fri 26 May 2023 15:49:51 AEST ]]>